Methods and systems for estimating a channel response by applying bias to an initial channel estimate

ABSTRACT

A channel response may be estimated from training symbols that are received over a channel, by determining an initial channel estimate from the training symbols and applying bias to the initial channel estimate to obtain a biased channel estimate. The biased channel estimate may then be used to demodulate a signal that is received over the channel.

BACKGROUND OF THE INVENTION

[0001] This invention relates to digital communications systems and methods, and more particularly to systems and methods for estimating a channel response from training symbols that are received over a channel.

[0002] Digital communications systems and methods are widely used for voice, image and/or data communications. As is well known to those having skill in the art, when communicating wirelessly, the time-varying multipath fading of wireless channels may make reliable transmission difficult. In efforts to reduce the effect of such time-varying channels, it is known to transmit a sequence of training symbols, which are known to both the transmitter and the receiver. The known training symbols may be provided within each burst or selected bursts of transmitted symbols, along with the payload symbols that are unknown to the receiver. Based on these known training symbols, a channel response may be estimated. The channel estimate can then be used to demodulate the unknown payload symbols.

SUMMARY OF THE INVENTION

[0003] A channel response may be estimated from training symbols that are received over a channel, according to some embodiments of the present invention, by determining an initial channel estimate from the training symbols that are received over the channel, and adding bias to the initial channel estimate to obtain a biased channel estimate. The biased channel estimate may then be used to demodulate a signal that is received over the channel. In some embodiments, bias is added by transforming the initial channel estimate according to a transform matrix, setting at least one tap of the transformed initial channel estimate to zero, and inverse transforming the transformed initial channel estimate with at least one tap set to zero, to obtain the biased channel estimate. The transforming, setting at least one tap and inverse transforming may be repeatedly performed.

[0004] Accordingly, some embodiments of the present invention can add bias to an initial channel estimate to obtain a biased channel estimate that reduces error in the estimated channel response compared to the initial channel estimate. It will be understood that, although the above description has focused primarily on methods of estimating a channel response, analogous systems and wireless receivers that employ similar techniques to estimate any other parameters also may be provided.

BRIEF DESCRIPTION OF THE DRAWINGS

[0005]FIG. 1 illustrates a conventional format of a burst of transmitted symbols in a conventional GSM/EDGE system.

[0006]FIG. 2 is a block diagram of a conventional wireless receiver.

[0007]FIG. 3 is a block diagram of systems, methods and receivers for estimating a channel response from training symbols that are received over a channel according to some embodiments of the present invention.

[0008]FIG. 4 is a flowchart of operations that may be performed to estimate a channel response according to other embodiments of the present invention.

[0009]FIG. 5 is a block diagram of other embodiments of the present invention.

[0010]FIG. 6 is a flowchart of operations that may be performed according to other embodiments of the present invention.

[0011]FIGS. 7 and 8 graphically illustrate gains that may be achieved by embodiments of the present invention.

DETAILED DESCRIPTION

[0012] The present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout. It will be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. In contrast, when an element is referred to as being “directly connected” or “directly coupled” to another element, there are no intervening elements present.

[0013] In order to provide a thorough and complete description, an overview on the use of training sequences to estimate a channel response will be provided, and specific examples of DC offset, joint demodulation and transmit diversity then will be described. Embodiments of the present invention then will generally be described. A detailed description will then be provided along with a description of application of embodiments of the present invention in the above-described examples.

[0014] Overview

[0015] As was described above, time-varying multipath fading and/or other properties of the channel may make reliable receiving difficult in a wireless communication system. To reduce the effect of such time-varying channels, a sequence of training symbols, known to both the transmitter and the receiver, is often transmitted, within some or each burst of transmitted symbols, along with the data or payload symbols that are unknown to the receiver. Based on these known training symbols, the channel response corresponding to the present burst is estimated, and such a channel estimate is then used for demodulating the unknown data symbols. As an example, a conventional format of a burst of transmitted symbols in a conventional Global System for Mobile Communications (GSM)/Enhanced Data for GSM Evolution (EDGE) system is shown in FIG. 1. In FIG. 1, the numbers in parentheses denote the number of symbols in each segment.

[0016] A block diagram of a conventional wireless receiver is shown in FIG. 2. As shown in FIG. 2, the wireless receiver 200 includes a radio frequency (RF) front end 210, an analog-to-digital (A/D) converter 220 and a sampler 230. A demodulator 240 produces estimates of transmitted data symbols, denoted by ŝ(n), using a channel estimate h that is obtained by a channel estimator 250 using the known training symbols.

[0017] It is known that the performance of channel estimation techniques over the known training symbols may depend heavily on the choice of the training sequence. Even the best and the most sophisticated method of channel estimation may still result in an inaccurate channel estimate if the training sequence is not designed properly for the specific application on hand. A description of three examples where this might happen will now be provided.

[0018] First, the training-sequence selection process might not have taken into account specific implementation impairments caused by certain receiver architectures. For example, certain receiver structures may induce a DC offset in the received signal. Channel estimation may incorporate the estimation of such a DC offset into the channel estimation. However, the selected training sequences may not work well with the estimation of a DC offset.

[0019] The second example may happen when receivers employ new, advanced signal processing techniques that may not have been foreseen during the development of an existing communication system. For example, a receiver may attempt to jointly demodulate a desired signal and a dominant interfering signal that may come from a base station of an adjacent cell in a cellular system. It is known that in a heavily loaded cellular system, receivers are often affected by a single dominant interfering signal. Consequently, the ability of a receiver to jointly demodulate desired and interfering signals can significantly improve its performance. To perform joint demodulation, a receiver may estimate the channel for the desired signal as well as that for the interfering signal over the training period. However, the training sequence used by two adjacent base stations may not necessarily have good cross correlation, which may be desirable for conventional channel estimation techniques.

[0020] The third example is that no “good enough” training sequence may exist at all for the specific applications. This may be caused by the length of the training sequence in the pre-defined burst format (26 in GSM/EDGE burst format of FIG. 1) being too short and/or the size of the alphabet of the training symbols being too small (e.g. 2 in GSM). For example, the use of transmit antenna diversity (also referred to as transmit diversity), where two or more antennas are used to transmit signals simultaneously, can be an effective way of improving the multipath fading channels. In transmit diversity, if the channel experienced by one of the transmit antenna fades down, the desired signal may still be recovered at the destination from the signal replica transmitted on the other antenna(s). Consequently, the probability of experiencing a complete signal outage due to multipath fading can be significantly reduced. However, to achieve this goal, the channel from each of the transmit antennas should be estimated from the received signal. To facilitate the estimation of these multiple channel responses, different training sequences with good cross-correlation properties among each other may be transmitted on different antennas. However, as the number of transmit antennas increases, it may be increasingly difficult to find a proper set of training sequences.

[0021] A mathematical treatment of the three examples mentioned above, namely, DC offset, joint demodulation, and transmit diversity, within the context of an EDGE system, now will be provided. These examples will be referred to below after describing embodiments of the present invention.

[0022] As to DC offset, consider the baseband received signal with an unknown DC offset given below: $\begin{matrix} {{{r(n)} = {{{\sum\limits_{k = 0}^{L - 1}{{h_{1}(k)}{s_{1}\left( {n - k} \right)}}} + {d\quad ^{{- j}\quad 3\quad n\quad {/8}}} + {{w(n)}\quad n}} = {L - 1}}},L,\ldots \quad,{N - 1},} & (1) \end{matrix}$

[0023] where d denotes the DC offset, {h₁(k)}_(k=0) ^(L−1) denotes the channel response to be estimated, {s₁(n)}_(n=0) ^(N−1) denotes the-training symbols, N=26 is the length of the training symbols, and {w(n)} denotes a white Gaussian noise process with variance σ_(w) ². Note that the term exp{−j3nπ/8} shown in (1) comes from the 3π/8 rotation imposed on the transmitted signals of EDGE systems for the purpose of blind modulation detection. In matrix form, Equation (1) can be written as $\begin{matrix} {{r = {{\underset{\underset{s}{}}{\left\lbrack {S_{1}\quad a} \right\rbrack}\underset{\underset{h}{}}{\begin{bmatrix} h_{1} \\ d \end{bmatrix}}} + w}},} & (2) \end{matrix}$

[0024] where r=(r(L−1),r(L), . . . ,r(N−1))^(T), h₁(0), h₁(1), . . . , h₁(L))^(T), and w=(w(L), w(L+1), . . . , w(N))^(T), $S_{1} = {\begin{pmatrix} {s_{1}\left( {L - 1} \right)} & {s_{1}\left( {L - 2} \right)} & \cdots & {s_{1}(0)} \\ {s_{1}(L)} & {s_{1}\left( {L - 1} \right)} & \cdots & {s_{1}(1)} \\ \vdots & \quad & \quad & \vdots \\ {s_{1}\left( {N - 1} \right)} & {s_{1}\left( {N - 2} \right)} & \cdots & {s_{1}\left( {N - L} \right)} \end{pmatrix}\quad {and}}$ $a = {\begin{pmatrix} 1 \\ ^{{- j}\quad 3{\pi/8}} \\ ^{{- {j(\quad {3{\pi/8}})}}2} \\ \vdots \\ ^{{- {j(\quad {3{\pi/8}})}}{({N - L})}} \end{pmatrix}.}$

[0025] One technique for estimating the channel h₁ is to jointly estimate the vector h=(h₁ ^(T),d)^(T) given the received signal vector r, and then take the first L components of the resulting estimate ĥ as an estimate of h₁. To facilitate such a joint DC and channel estimation, the training sequence {s₁(n)}_(n=0) ^(N−1) should be designed such that the columns of S₁ are mutually orthogonal and are individually orthogonal to the vector a, or equivalently, that the columns of the combined matrix S are mutually orthogonal to each other. However, the training sequences are often designed only to make the columns of S₁ to be mutually orthogonal. For instance, the columns of the matrix S₁ that correspond to the existing training sequences used in GSM/EDGE systems are not orthogonal to the vector a.

[0026] As to joint demodulation, in a receiver that jointly demodulates a desired signal and an interfering signal, the received baseband signal is modeled as $\begin{matrix} {{{r(n)} = {{\sum\limits_{i = 0}^{L - 1}{{h_{1}(i)}{s_{1}\left( {n - i} \right)}}} + {\sum\limits_{i = 0}^{L - 1}{{h_{2}(i)}{s_{2}\left( {n - i} \right)}}} + {w(n)}}},} & (3) \end{matrix}$

[0027] for n=L−1, L, . . . , N−1, where {h₁(i)}_(i=0) ^(L−1) and {h₂(i)}_(i=0) ^(L−1) denotes the channel response of the desired and interfering signal, respectively, (for simplicity, both channels are assumed to have length L), and {w(n)} denotes a white Gaussian noise process with variance σ_(w) ². In matrix form, the received signal r(n) over the training symbols can be expressed as $\begin{matrix} {{r = {\left\lbrack {S_{1}\quad S_{2}} \right\rbrack \begin{bmatrix} h_{1} \\ h_{2} \end{bmatrix}}},} & (4) \end{matrix}$

[0028] where r=(r(L−1),r(L), . . . ,r(N−1))^(T), h₁=(h₁(0),h₁(1), . . . ,h₁(L))^(T), h₂=(h₂(0),h₂(1), . . . ,h₂(L))^(T), w=(w(L−1), w(L), . . . , w(N−1))^(T), $S_{1} = {\begin{pmatrix} {s_{1}\left( {L - 1} \right)} & {s_{1}\left( {L - 2} \right)} & \cdots & {s_{1}(0)} \\ {s_{1}(L)} & {s_{1}\left( {L - 1} \right)} & \cdots & {s_{1}(1)} \\ \vdots & \quad & \quad & \vdots \\ {s_{1}\left( {N - 1} \right)} & {s_{1}\left( {N - 2} \right)} & \cdots & {s_{1}\left( {N - L} \right)} \end{pmatrix}\quad {and}}$ $S_{2} = {\begin{pmatrix} {s_{2}\left( {L - 1} \right)} & {s_{2}\left( {L - 2} \right)} & \cdots & {s_{2}(0)} \\ {s_{2}(L)} & {s_{2}\left( {L - 1} \right)} & \cdots & {s_{2}(1)} \\ \vdots & \quad & \quad & \vdots \\ {s_{2}\left( {N - 1} \right)} & {s_{2}\left( {N - 2} \right)} & \cdots & {s_{2}\left( {N - L} \right)} \end{pmatrix}.}$

[0029] One technique for estimating the channels h₁ and h₂ is to jointly estimate both of them given the received signal vector r. To facilitate such a joint channel estimation, the training sequences {s₁(n)}_(n=1) ^(L−1) and {s₂(n)}_(n=1) ^(L−1) from adjacent base stations should be designed such that the columns of S≡[S₁, S₂] are mutually orthogonal. However, there is no guarantee that such a property will hold in existing cellular systems, such as GSM systems.

[0030] Finally, as to transmit diversity, in a communication system employing transmit diversity with n_(T) transmit antenna, the received baseband signal is given by $\begin{matrix} {{{r(n)} = {{\sum\limits_{k = 1}^{n_{T}}{\sum\limits_{i = 0}^{L - 1}{{h_{k}(i)}{s_{k}\left( {n - i} \right)}}}} + {w(n)}}},} & (5) \end{matrix}$

[0031] for n=L−1, L, . . . , N−1, where {h_(k)(i)}_(i=0) ^(L−1) denotes the channel response of length L from the transmit antenna k, and {w(n)} denotes a white Gaussian noise process with variance σ_(w) ². In matrix form, the received signal r(n) over the training symbols can be expressed as $\begin{matrix} {{r = {{\underset{\underset{s}{}}{\left\lbrack {S_{1}\quad S_{2}\quad \ldots \quad S_{n_{T}}} \right\rbrack}\underset{\underset{h}{}}{\begin{bmatrix} h_{1} \\ h_{2} \\ \vdots \\ h_{n_{T}} \end{bmatrix}}} + w}},} & (6) \end{matrix}$

[0032] where r=(r(L−1),r(L), . . . , r(N−1))^(T), h_(k)=(h_(k)(0), h_(k)(1), . . . , h_(k)(L))^(T), w=(w(L−1), w(L), . . . , w(N−1))^(T), $S_{k} = {\begin{pmatrix} {s_{k}\left( {L - 1} \right)} & {s_{k}\left( {L - 2} \right)} & \cdots & {s_{k}(0)} \\ {s_{k}(L)} & {s_{k}\left( {L - 1} \right)} & \cdots & {s_{k}(1)} \\ \vdots & \quad & \quad & \vdots \\ {s_{k}\left( {N - 1} \right)} & {s_{k}\left( {N - 2} \right)} & \cdots & {s_{k}\left( {N - L} \right)} \end{pmatrix}.}$

[0033] One technique for estimating the channels {h_(k)}_(k=1) ^(n) ^(_(T)) is to jointly estimate the vector h given the received signal vector r. To facilitate such a joint channel estimation, the training sequences {s_(k)}_(k=1) ^(n) ^(_(T)) should be designed such that the columns of S≡[S₁, S₂, . . . , S_(n) _(T) ] are mutually orthogonal. However, if the length of the training sequences and/or the size of their alphabet are not large enough, there may not exist any set of training sequences with, or close to having, such a property.

[0034] Note that the received signals in matrix form (Equations (2) and (6)) for both the example of DC offset and the examples of transmit diversity (or the combination of both) can be formulated in the following general form:

r=Sh+w,  (7)

[0035] where w is a Gaussian-distributed noise vector. In channel estimation, it is desired to estimate the vector h given the received signal r. Embodiments of the invention can improve the estimation of h over conventional estimation methods when the columns of the matrix S are not mutually orthogonal to each other. For simplicity, the noise vector w is assumed to be white in the following descriptions. However, one or ordinary skill in the art can generalize to the case when the noise vector w has non-white statistics.

[0036] General Description

[0037] Embodiments of the present invention can provide systems, methods and receivers that systematically add bias to the channel estimate that will result in a smaller overall estimation error than, say, the conventional channel estimation methods, which may compute a non-biased channel estimate. It can be shown that by trading off bias with the statistical error caused by the additive noise process, according to the characteristics of the matrix S in some embodiments of the invention, overall estimation error can be significantly reduced. More precisely, consider the overall mean squared estimation error, which can be expressed as sum of two terms: $\begin{matrix} \begin{matrix} {{{tr}\left\lbrack {{E\left( {h - \hat{h}} \right)}\left( {h - \hat{h}} \right)^{H}} \right\rbrack} = {\underset{\underset{Bias}{}}{{tr}\left\lbrack {\left( {h - {E\quad \hat{h}}} \right)\left( {h - {E\quad \hat{h}}} \right)^{H}} \right\rbrack} +}} \\ {\underset{\underset{{Statistical}\quad {Error}}{}}{{tr}\left\lbrack {{E\left( {\hat{h} - {E\quad \hat{h}}} \right)}\left( {\hat{h} - {E\quad \hat{h}}} \right)^{H}} \right\rbrack}} \end{matrix} & (8) \end{matrix}$

[0038] Some embodiments of the invention can compute an estimate ĥ which can provide a good tradeoff between the two terms in (8).

[0039]FIG. 3 is a block diagram of systems, methods and receivers for estimating a channel response from training symbols that are received over a channel according to some embodiments of the present invention. These embodiments may be used, for example, in the channel estimator 250 of FIG. 2. As shown in FIG. 3 at Block 310, an initial channel estimating circuit is configured to determine an initial channel estimate ĥ₀ from the training symbols r that are received. Conventional channel estimation techniques may be used. At Block 320, a bias applying circuit is configured to apply a bias to the initial channel estimate ĥ₀, to obtain a biased channel estimate ĥ.

[0040]FIG. 4 is a flowchart of operations that may be performed to estimate a channel response according to other embodiments of the present invention. These operations may be used, for example, by the channel estimator 250 of FIG. 2.

[0041] As shown in FIG. 4 at Block 410, an initial channel estimate is determined from the training symbols that are received, for example using conventional techniques. At Block 420, bias is added to obtain a biased channel estimate. At Block 430, a test is made as to whether additional improvement is desired and, if so, operations at Block 420 may be repeatedly performed until a desired improvement is obtained. Once obtained, at Block 440, the biased channel estimate is used to demodulate a signal that is received over the channel.

[0042] A common technique for estimating h in (7) is the least squares (LS) channel estimation. The LS estimate of h given r is

ĥ _(LS)=(S ^(H) S)⁻¹ S ^(H) r,  (9)

[0043] which is known to be an unbiased estimate of the true channel h, i.e. Eĥ_(LS)=h. In effect, such an estimate constrains the bias, as shown in the first term in (8), to be zero and then minimizes the statistical error, as shown in the second term in (8), for the given matrix S. However, when the matrix S does not have mutually orthogonal columns, by allowing a non-zero bias, the statistical error can be much further reduced.

[0044]FIG. 5 is a block diagram of other embodiments of the present invention. In these embodiments, the receiver first performs an initial unbiased channel estimation, for example the LS channel estimation described in (9), at Block 510. Then, at Block 520, a circuit is configured to transform the initial channel estimate. For example, the resulting channel estimate ĥ_(o) is transformed according to a pre-computed orthogonal matrix Ψ at Block 520. In some embodiments, the matrix Ψ has the eigenvectors of (a) the matrix S^(H)S or (b) the matrix (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹) as columns, where the noise power σ_(w) ² may be obtained from the initial channel estimation. At Block 530, a circuit is configured to perform an operation on the transformed channel estimate to change at least one of its values. In some embodiments, at Block 530, all but K taps (where K<L) of the transformed channel estimate ĉ_(o) are set to zero according to certain selection criteria. At Block 540, a circuit is configured to inverse transform the transformed initial channel estimate on which the operation was performed. For example, the channel estimate ĥ (after the first iteration) is obtained by inverse transforming the resulting estimate ĉ at Block 540.

[0045] In some embodiments, the number K may be predetermined according to the distribution of eigenvalues of the matrix S^(H)S and stored in the receivers. In these embodiments, all taps of ĉ_(o) but those corresponding to the K largest eigenvalues of S^(H)S are set to zero. In other embodiments, K may be selected to be the number of positive eigenvalues of the matrix (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹). These embodiments can be equivalent to selecting K by comparing each individual element of the transformed channel estimate ĉ_(o) to at least one threshold and then setting K to be the number of elements that are greater than the corresponding thresholds. More precisely, the i-th threshold for the i-th tap of ĉ_(o) to compare may be given by $\gamma_{i} = \frac{\sigma_{w}^{2}}{\left\lbrack {{\Psi^{H}\left( {S^{H}S} \right)}\Psi} \right\rbrack_{ii}}$

[0046] where [A]_(H) denotes the i-th diagonal element of the matrix A, and the columns of Ψ here are the eigenvectors of the matrix (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹).

[0047] For example, when the LS channel estimation in (9) is employed as the initial channel estimation ĥ_(o), the new channel estimate ĥ is given by:

ĥ=Ψ _(K)Ψ_(K) ^(H) ĥ _(o)=Ψ_(K)Ψ_(K) ^(H)(S ^(H) S)⁻¹ S ^(H) r.  (10)

[0048] where Ψ_(K) denotes a L by K matrix, whose columns are mutually orthogonal to each other and may be chosen as (a) the K eigenvectors of the matrix S^(H)S with the largest eigenvalues, or as (b) those eigenvectors of the matrix (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹) that have positive eigenvalues. If K=L, i.e. all taps of the transformed channel estimate ĉ_(o) are preserved, the estimate in (10) reduces to the ordinary LS channel estimate described in (9).

[0049]FIG. 5 also includes an optional feedback loop 550 according to other embodiments of the invention, where the channel estimate ĥ from the first iteration is used to compute a new transform Ψ, which is then applied to the initial channel estimate ĥ_(o) again. A new value of K or a set of new thresholds to which the elements of ĉ_(o) are compared may also be updated. In some embodiments, the new transform is computed using the eigenvectors of the matrix (ĥĥ^(H)−σ_(w) ²(S^(H)S)⁻¹) as the columns. More than two iterations may be executed through the feedback loop to further improve the final channel estimate ĥ.

[0050]FIG. 6 is a flowchart of operations that may be performed according to other embodiments of the present invention. As shown in FIG. 6, an initial unbiased channel estimate is computed at Block 610. At Block 620, the initial channel estimate is converted into a transformed channel estimate. At Block 630, a number of taps K to keep in the transformed channel estimate is selected if this number is not predetermined. At Block 640, all but K-taps of the transformed channel estimate are set to 0. At Block 650, the inverse transform is applied to the resulting bias transformed channel estimate. At Block 660, if additional improvement is desired, then at Block 670 the new transform and new thresholds are computed if desired.

[0051] In still other embodiments of the invention, at Blocks 530 or 640, K-taps are set to 0 and the remaining taps are kept. In these embodiments, the new channel estimate may be subtracted from the initial channel estimate rather than being added thereto at Block 330 of FIG. 3.

[0052] Detailed Explanation

[0053] A detailed explanation of introducing intentional bias into an initial channel -estimate in order to reduce the overall estimation error, according to some embodiments of the present invention, now will be provided. It will be shown that when no a priori information about the true channel h is known, the channel estimate in (10) that resulted from the choice of the columns of Ψ_(K) being

[0054] (a) the K eigenvectors of the matrix S^(H)S with the largest eigenvalues or

[0055] (b) the eigenvectors of the matrix (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹) with positive eigenvalues,

[0056] gives a good tradeoff between the bias and the statistical error as shown in (8) for any K<L.

[0057] Let Ψ be the unitary matrix in FIG. 5, let c=(c₁, c₂, . . . , c_(L))^(T)=Ψ^(H)h (or equivalently h=Ψc) and let ĉ=(ĉ₁, ĉ₂, . . . , ĉ_(L))^(T)=Ψ^(H)ĥ. Also let l={i₁, i₂, . . . , i_(K)} be a set of integers such that 1≦i₁<i₂< . . . <i_(K)≦N, which will be determined later. Corresponding to any given I, let J(l) (or just J) denote an L by K matrix with the (i_(k),k) element being one, where k=1, 2, . . . , K, and with all other elements being zero. Note that multiplying a channel estimate ĉ_(o) by JJ^(H) is the same as setting all taps whose indices are not in I to zero.

[0058] A formula of the overall estimation error defined in (8) for embodiments of the invention depicted in FIG. 5 will be described. Then, the estimation error can be minimized over integer sets I (or equivalently, J in the format described above) and unitary transforms Ψ, under the following constraints on the estimate ĥ: (1) ĉ_(j)=0 for all j∉I, and (2) Eĥ₀=h for all j∈I.

[0059] From (8), the bias of ĥ (i.e. the first term in (8)) is given by $\begin{matrix} {\Delta_{ɛ}^{2} = {{tr}\left\lbrack {\left( {h - {E\quad \hat{h}}} \right)\left( {h - {E\quad \hat{h}}} \right)^{H}} \right\rbrack}} \\ {= {{tr}\left\lbrack {{\Psi \left( {c - {E\quad \hat{c}}} \right)}\left( {c - {E\quad \hat{c}}} \right)^{H}\Psi^{H}} \right\rbrack}} \\ {= {{tr}\left\lbrack {\left( {c - {E\quad \hat{c}}} \right)\left( {c - {E\quad \hat{c}}} \right)^{H}} \right\rbrack}} \\ {= {{c}^{2} - {c^{H}\left( {E\quad \hat{c}} \right)} - {\left( {E\quad {\hat{c}}^{H}} \right)c} + {{E\quad \hat{c}}}^{2}}} \\ {= {{h}^{2} - {{J^{H}c}}^{2}}} \\ {= {{h}^{2} - {{tr}\left\lbrack {J^{H}\Psi^{H}{hh}^{H}\Psi \quad J} \right\rbrack}}} \end{matrix}$

[0060] where the fifth equality follows from the fact that Eĉ=EJJ^(H)ĉ_(o)=JJ^(H)(Eĉ_(o))=JJ^(H)c since ĉ_(o) is an unbiased estimate of c. By substituting ĥ=ΨJJ^(H)Ψ^(H)ĥ_(o) in the second term of (8), the statistical error is obtained as $\begin{matrix} {\sigma_{ɛ}^{2} = {{tr}\left\lbrack {{E\left( {\hat{h} - {E\quad \hat{h}}} \right)}\left( {\hat{h} - {E\quad \hat{h}}} \right)^{H}} \right\rbrack}} \\ {= {{tr}\left\lbrack {E\quad \Psi \quad {JJ}^{H}{\Psi^{H}\left( {{\hat{h}}_{o} - {E\quad {\hat{h}}_{o}}} \right)}\left( {{\hat{h}}_{o} - {E\quad {\hat{h}}_{o}}} \right)^{H}\Psi \quad {JJ}^{H}\Psi^{H}} \right\rbrack}} \\ {= {{tr}\left\lbrack {E\quad J^{H}{\Psi^{H}\left( {{\hat{h}}_{o} - {E\quad {\hat{h}}_{o}}} \right)}\left( {{\hat{h}}_{o} - {E\quad {\hat{h}}_{o}}} \right)^{H}\Psi \quad J} \right\rbrack}} \\ {= {{tr}\left\lbrack {E\quad J^{H}{\Psi^{H}\left( {{\hat{h}}_{o} - h} \right)}\left( {{\hat{h}}_{o} - h} \right)^{H}\Psi \quad J} \right\rbrack}} \\ {\geq {{tr}\left\lbrack {E\quad J^{H}{\Psi^{H}\left( {- \frac{{\partial^{2}\ln}\quad {p\left( {rh} \right)}}{\partial h^{2}}} \right)}^{- 1}\Psi \quad J} \right\rbrack}} \\ {= {\sigma_{w}^{2}{{tr}\left\lbrack {J^{H}{\Psi^{H}\left( {S^{H}S} \right)}^{- 1}\Psi \quad J} \right\rbrack}}} \end{matrix}$

[0061] where the fourth equality above follows from the fact that ĥ_(o) is an unbiased estimate of h, and where the inequality follows from the Cramer-Rao bound for general unbiased estimates. This inequality becomes equality when the ordinary LS estimation is used for computing the initial channel estimate. In other words, to minimize the statistical error, one should choose

ĥ _(o)=(S ^(H) S)⁻¹ S ^(H) r,  (11)

[0062] or in other words,

ĥ=ΨJJ ^(H)Ψ^(H) ĥ _(o) =ΨJJ ^(H)Ψ^(H)(S ^(H) S)⁻¹ S ^(H) r.  (12)

[0063] Noting that Ψ_(K)=ΨJ, the proposed estimate shown in (10) is obtained.

[0064] Next, a choice for Ψ and J according to some embodiments of the present invention will be described. By summing the contribution from the bias and the statistical error, the overall estimation error becomes $\begin{matrix} \begin{matrix} {{{tr}\left\lbrack {{E\left( {h - \hat{h}} \right)}\left( {h - \hat{h}} \right)^{H}} \right\rbrack} = {\Delta_{ɛ}^{2} + \sigma_{ɛ}^{2}}} \\ {= {{h}^{2} - {{tr}\left\lbrack {J^{H}{\Psi^{H}\left( {{hh}^{H} - {\sigma_{w}^{2}\left( {S^{H}S} \right)}^{- 1}} \right)}\Psi \quad J} \right\rbrack}}} \\ {= {{h}^{2} - {\sum\limits_{k = 1}^{K}{{\phi_{i_{k}}^{H}\left( {{hh}^{H} - {\sigma_{w}^{2}\left( {S^{H}S} \right)}^{- 1}} \right)}\phi_{i_{k}}}}}} \end{matrix} & (13) \end{matrix}$

[0065] where φ_(i) denotes the i th column of Ψ. From (13), it appears that the columns of the best matrix Ψ should be the one with the eigenvectors of the matrix (hh^(H)−σ_(w) ²(S^(H)S)⁻¹), and a set of integers {i_(k)}_(k=1) ^(K) should be those indices that corresponds to the positive eigenvalues of (hh^(H)−σ_(w) ²(S^(H)S)⁻¹), where K here represents the number of eigenvalues of (hh^(H)−σ_(w) ²(S^(H)S)⁻¹) that are positive.

[0066] However, since hh^(H) is not known a priori, one may use ĥ_(o)ĥ_(o) ^(H) as an estimate of hh^(H), which leads to (b) the transform (ĥ_(o)ĥ_(o) ^(H)−σ_(w) ²(S^(H)S)⁻¹). Alternatively, one may optimize Ψ in a minimax sense (i.e. for the worse channel realization) in the first iteration: $\begin{matrix} \begin{matrix} {\Psi = {\underset{{\Psi^{\prime}:{\Psi^{H}\Psi}} = I}{\arg \quad \min}\quad {\max\limits_{h:{{h}^{2} \leq P}}\left\lbrack {{h}^{2} - {\sum\limits_{k = 1}^{K}{{\phi_{i_{k}}^{H}\left( {{hh}^{H} - {\sigma_{w}^{2}\left( {S^{H}S} \right)}^{- 1}} \right)}\phi_{i_{k}}}}} \right\rbrack}}} \\ {= {\underset{{\Psi^{\prime}:{\Psi^{H}\Psi}} = I}{\arg \quad \min}\quad\left\lbrack {\sigma_{w}^{2}{\sum\limits_{k = 1}^{K}{{\phi_{i_{k}}^{H}\left( {S^{H}S} \right)}^{- 1}\phi_{i_{k}}}}} \right\rbrack}} \end{matrix} & (14) \end{matrix}$

[0067] where P is any positive constant indicating the maximum strength of the channel response h under consideration. It appears from (14) that the, columns of the transform Ψ should be chosen as the eigenvectors of (b) the matrix S^(H)S, and the set of integers {i_(k)}_(k=1) ^(K) should be those indices corresponding to the largest eigenvalues of S^(H)S. One may also think of this choice of Ψ as designing for the low signal-to-noise situation where σ_(w) ² is large.

[0068] Embodiments of the invention may significantly improve performance of receivers that have a DC offset problem, such as the homodyne receivers typically used for EDGE. FIG. 7 shows the gains that may be achieved by an embodiment of the invention with one iteration, as K varies, in mean-squared estimation error (in dB) over the LS channel estimation, which is also equal to the Cramer-Rao lower bound on any unbiased channel estimation techniques. The eigenvectors of the matrix S^(H)S are used as the columns of the transform Ψ. The GSM training sequence TS5 and a joint estimation of a 7-tap baseband channel and 1-tap DC at an C/N ratio of 10 dB are assumed in this figure, which shows that up to 2 dB gain in mean squared estimation error can be achieved by reducing K from L=8 to 6.

[0069]FIG. 8 shows the corresponding gain in mean-squared estimation error in the case of joint channel estimation of two 7-tap channels for transmit diversity. A C/N ratio of 18 dB and the GSM training sequences TS0 and TS5 and are assumed in the figure. It is shown that up to 11 dB in mean-squared channel estimation can be achieved by reducing K from L=14 to 11.

[0070] In the drawings and specification, there have been disclosed embodiments of the invention and, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation, the scope of the invention being set forth in the following claims. 

1. A method of estimating a channel response from training symbols that are received over a channel, the method comprising: determining an initial channel estimate from the training symbols that are received over the channel; and applying bias to the initial channel estimate to obtain a biased channel estimate.
 2. A method according to claim 1 further comprising: using the biased channel estimate to demodulate a signal that is received over the channel.
 3. A method according to claim I wherein the applying bias to the initial channel estimate to obtain a biased channel estimate comprises: transforming the initial channel estimate; performing an operation on the transformed initial channel estimate; and inverse transforming the transformed initial channel estimate on which the operation was performed, to obtain the biased channel estimate.
 4. A method according to claim 3 further comprising: repeating the transforming the initial channel estimate, the performing an operation on the transformed initial channel estimate and the inverse transforming the transformed initial channel estimate on which the operation was performed, to obtain the biased channel estimate.
 5. A method according to claim 1 wherein the applying bias to the initial channel estimate to obtain a biased channel estimate comprises: transforming the initial channel estimate according to a transform matrix; setting at least one tap of the transformed initial channel estimate to zero; and inverse transforming the transformed initial channel estimate with at least one trap set to zero, to obtain the biased channel estimate.
 6. A method according to claim 5 further comprising: repeating the transforming the initial channel estimate according to a transform matrix, the setting at least one tap of the transformed initial channel estimate to zero and the inverse transforming the transformed initial channel estimate with at least one trap set to zero, to obtain the biased channel estimate.
 7. A method according to claim 5 wherein the at least one tap is determined by comparing taps of the transformed initial channel estimate to at least one threshold.
 8. A method according to claim 5 wherein the at least one tap comprises at least one tap having largest values.
 9. A method according to claim 1 wherein the applying bias to the initial channel estimate to obtain a biased channel estimate comprises applying bias to-the initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate.
 10. A method according to claim 1 wherein the applying bias to the initial channel estimate to obtain a biased channel estimate comprises applying bias to the initial channel estimate that reduces errors in the initial channel estimate that are due to non-orthogonality of the training symbols.
 11. A method of estimating a channel response from training symbols that are received over a channel, the method comprising: applying bias to an initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate.
 12. A method according to claim 11 further comprising: using the biased channel estimate to demodulate a signal that is received over the channel.
 13. A system for estimating a channel response from training symbols that are received over a channel, the system comprising: an initial channel estimating circuit that is configured to determine an initial channel estimate from the training symbols that are received over the channel; and a bias computing circuit that is configured to apply bias to the initial channel estimate to obtain a biased channel estimate.
 14. A system according to claim 13 further comprising: a demodulator that is configured to use the biased channel estimate to demodulate a signal that is received over the channel.
 15. A system according to claim 13 wherein the bias computing circuit comprises: a circuit that is configured to transform the initial channel estimate; a circuit that is configured to perform an operation on the transformed initial channel estimate; and a circuit that is configured to inverse transform the transformed initial channel estimate on which the operation was performed, to obtain the biased channel estimate.
 16. A system according to claim 13 wherein the bias computing circuit comprises: a circuit that is configured to transform the initial channel estimate according to a transform matrix; a circuit that is configured to set at least one tap of the transformed initial channel estimate to zero; and a circuit that is configured to inverse transform the transformed initial channel estimate with at least one trap set to zero, to obtain the biased channel estimate.
 17. A system according to claim 16 wherein the at least one tap is determined by comparing taps of the transformed initial channel estimate to at least one threshold.
 18. A system according to claim 16 wherein the at least one tap comprises at least one tap having largest values.
 19. A system according to claim 13 wherein the bias computing circuit is further configured to apply bias to the initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate.
 20. A system according to claim 13 wherein the bias computing circuit is further configured to apply bias to the initial channel estimate that reduces errors in the initial channel estimate that are due to non-orthogonality of the training symbols.
 21. A system for estimating a channel response from training symbols that are received over a channel, the system comprising: a bias computing circuit that is configured to apply bias to an initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate.
 22. A system according to claim 21 further comprising: a demodulator that is configured to use the biased channel estimate to demodulate a signal that is received over the channel.
 23. A wireless receiver comprising: a front end that is configured to receive training symbols over a channel; an initial channel estimating circuit that is configured to determine an initial channel estimate from the training symbols that are received over the channel; a bias computing circuit that is configured to apply bias to the initial channel estimate to obtain a biased channel estimate; and a demodulator that is configured to use the biased channel estimate to demodulate a signal that is received over the channel.
 24. A wireless receiver according to claim 23 wherein the bias computing circuit comprises: a circuit that is configured to transform the initial channel estimate; a circuit that is configured to perform an operation on the transformed initial channel estimate; and a circuit that is configured to inverse transform the transformed initial channel estimate on which the operation was performed, to obtain the biased channel estimate.
 25. A wireless receiver according to claim 23 wherein the bias computing circuit comprises: a circuit that is configured to transform the initial channel estimate according to a transform matrix; a circuit that is configured to set at least one tap of the transformed initial channel estimate to zero; and a circuit that is configured to inverse transform the transformed initial channel estimate with at least one trap set to zero, to obtain the biased channel estimate.
 26. A wireless receiver according to claim 23 wherein the bias computing circuit is further configured to apply bias to the initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate.
 27. A system according to claim 23 wherein the bias computing circuit is further configured to apply bias to the initial channel estimate that reduces errors in the initial channel estimate that are due to non-orthogonality of the training symbols.
 28. A wireless receiver comprising: a front end that is configured to receive training symbols over a channel; a bias computing circuit that is configured to apply bias to an initial channel estimate to obtain a biased channel estimate that reduces error in an estimated channel response compared to the initial channel estimate; and a demodulator that is configured to use the biased channel estimate to demodulate a signal that is received over the channel. 